منابع مشابه
Signed tree associahedra
Spines T a tree on a signed ground set V = V− t V. Spine on T = directed and labeled tree S such that • the labels of the nodes of S form a partition of the signed ground set V, • at a node labeled by U = U− t U, the source label sets of the incoming arcs are subsets of distinct connected components of TrU−, and the sink label sets of the outgoing arcs are subsets of distinct connected componen...
متن کاملPseudograph associahedra
Given a simple graph G, the graph associahedron KG is a simple polytope whose face poset is based on the connected subgraphs of G. This paper defines and constructs graph associahedra in a general context, for pseudographs with loops and multiple edges, which are also allowed to be disconnected. We then consider deformations of pseudograph associahedra as their underlying graphs are altered by ...
متن کاملY - systems and generalized associahedra
The goals of this paper are two-fold. First, we prove, for an arbitrary finite root system Φ, the periodicity conjecture of Al. B. Zamolodchikov [24] that concerns Y -systems, a particular class of functional relations playing an important role in the theory of thermodynamic Bethe ansatz. Algebraically, Y -systems can be viewed as families of rational functions defined by certain birational rec...
متن کاملTwo Signed Associahedra
The associahedron is a convex polytope whose vertices correspond to triangulations of a convex polygon. We define two signed or hyperoctahedral analogues of the associahedron, one of which is shown to be a simple convex polytope, and the other a regular CW-sphere.
متن کاملOf Graph - Associahedra
Given any finite graph G, we offer a simple realization of the graph-associahedron PG using integer coordinates.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Forum Mathematicum
سال: 2014
ISSN: 0933-7741,1435-5337
DOI: 10.1515/forum-2011-0130